Deadlock detection of Java Bytecode

This paper presents a technique for deadlock detection of Java programs. The technique uses typing rules for extracting infinite-state abstract models of the dependencies among the components of the Java intermediate language -- the Java bytecode. Models are subsequently analysed by means of an extension of a solver that we have defined for detecting deadlocks in process calculi. Our technique is complemented by a prototype verifier that also covers most of the Java features.Comment: Pre-proceedings paper presented at the 27th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2017), Namur, Belgium, 10-12 October 2017 (arXiv:1708.07854

A type system for components

In modern distributed systems, dynamic reconfiguration, i.e., changing at runtime the communication pattern of a program, is chal- lenging. Generally, it is difficult to guarantee that such modifications will not disrupt ongoing computations. In a previous paper, a solution to this problem was proposed by extending the object-oriented language ABS with a component model allowing the programmer to: i) perform up- dates on objects by means of communication ports and their rebinding; and ii) precisely specify when such updates can safely occur in an object by means of critical sections. However, improper rebind operations could still occur and lead to runtime errors. The present paper introduces a type system for this component model that extends the ABS type system with the notion of ports and a precise analysis that statically enforces that no object will attempt illegal rebinding

Softly safely spoken: Role playing for Session Types

Session types have made much progress at permitting programs be statically verified concordant with a specified protocol. However, it is difficult to build abstractions of, or encapsulate Session types, thus limiting their flexibility. Global session types add further constraints to communication, by permitting the order of exchanges amongst many participants to be specified. The cost is that the number of participants is statically fixed. We introduce Roles in which, similarly to global session types, the number of roles and the conversations involving roles are statically known, but participants can dynamically join and leave roles and the number of participants within a role is not statically known. Statically defined roles which conform to a specified conversation can be dynamically instantiated, participants can be members of multiple roles simultaneously and can participate in multiple conversations concurrently

Search for bbbˉbˉbb\bar{b}\bar{b} tetraquark decays in 4 muons, B+B−B^{+} B^{-}, B0Bˉ0B^0 \bar{B}^0 and Bs0Bˉs0B_s^0 \bar{B}_s^0 channels at LHC

We perform a quantitative analysis of the $bb\bar{b}\bar{b}$ tetraquark decays into hidden- and open-bottom mesons and calculate, for the first time, the $bb\bar{b}\bar{b}$ tetraquark total decay width. On the basis of our results, we propose the $bb\bar{b}\bar{b} \to B^{+} B^{-} (B^0 \bar{B}^0) (B_s^0 \bar{B}_s^0) \to l^{+} l^{-}+\text{X}$ decays as the most suitable channels to observe the $bb\bar{b}\bar{b}$ tetraquark states, since the calculated two-lepton cross section upper limit, $\simeq 39$ fb, is so large as to be potentially detectable with the 2018 LHCb sensitivity, paving the way to the observation of the $bb\bar{b}\bar{b}$ tetraquark in the future LHCb upgrade. The $4\mu$ signal for the ground state, $J^{PC}=0^{++}$, is likely to be too small even for the upgraded LHCb, but it may not be hopeless for the $J^{PC}=2^{++}$ fully-bottom state.Comment: 11 pages, 1 figur